Metastability of fair bandwidth sharing under fluctuating demand and necessity of flow admission control

نویسنده

  • V. Marbukh
چکیده

Introduction: A flow level Markov model of fair bandwidth sharing under fluctuating demand has been proposed in [1, 2] for a case of file transfer flows, and in [3] for a case of a mixture of file transfer and streaming flows. These Markov models assume separation of timescales: given numbers of flows in progress, the fair bandwidth sharing protocol reaches equilibrium much faster than the numbers of flows in progress change due to flow arrivals=departures. Stability under the condition that each link can accommodate its average load was established in [2, 3]. However, these Markov models and stability results do not account for bandwidth wasted on transmissions of ‘dead’ file transferring packets which will be dropped downstream and then retransmitted. This Letter proposes to account for wasted bandwidth by assuming that the file transfer rates are determined by the end-to-end goodputs rather than the corresponding throughputs as in [1–3]. The ‘goodputbased’ Markov model is unstable even under light exogenous load, when the corresponding throughput-based models [1–3] are stable. The instability, observed in [4] by simulations, is a result of demand fluctuations: increase in the number of flows in progress causes increase in packet loss, reducing goodput and further increasing the number of flows in progress. Despite instability, a desirable metastable network state with a finite number of flows in progress may still exist. The network can be stabilised in a close neighbourhood of this metastable state with appropriately designed flow admission control at the price of a small flow rejection probability. Network over provisioning without flow admission control only reduces but does not eliminate the instability region.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance of Multi-beam Satellite Systems With A New Bandwidth Sharing Algorithm

An efficient resource allocation is important to guarantee the best performance with a fair distribution of multi-beam satellite capacity to provide satellite multimedia and broadcasting services. In this way, available bandwidth and capacity problems in new satellite system likes Multi-Input-Multi-Output (MIMO), exploring new techniques for enhancing spectral efficiency in satellite communicat...

متن کامل

Bandwidth sharing and admission control for elastic traffic

We consider the performance of a network like the Internet handling so-called elastic traffic where the rate of flows adjusts to fill available bandwidth. Realized throughput depends both on the way bandwidth is shared and on the random nature of traffic. We assume traffic consists of point to point transfers of individual documents of finite size arriving according to a Poisson process. Notabl...

متن کامل

Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State

Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechanisms. Traditional mechanisms to achieve fair sharing (e.g., Weighted Fair Queueing, Flow Random Early Discard) require per-flow state to determine which packets to drop under congestion, and therefore are complex to implement at t...

متن کامل

Fair Admission Control to Achieve Guaranteed Bandwidth Allocation

In this paper, we present a theoretic framework for admission controls and bandwidth allocations at network links to achieve guaranteed bandwidth allocations, which guarantee to allocate admitted flows data rates that are above their required minimum bandwidths. The admission control and bandwidth allocation are devised from the optimal solution of maximizing aggregate social welfare of the net...

متن کامل

Bandwidth Sharing and Admission Control for Elastic Traac

We consider the performance of a network like the In-ternet handling so-called elastic traac where the rate of ows adjusts to ll available bandwidth. Realized throughput depends both on the way bandwidth is shared and on the random nature of traac. We assume traac consists of point to point transfers of individual documents of nite size arriving according to a Poisson process. Notable results a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007